Necessary field size and probability for MDP and complete MDP convolutional codes
نویسندگان
چکیده
منابع مشابه
Complete MDP convolutional codes
Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible. It has been shown that, transmitting over an erasure channel, these codes have optimal recovery rate for windows of a certain length. Reverse MDP convolutional codes have the additional advantage that they are suitable for forward and backward decoding algorithms. Beyond th...
متن کاملOn superregular matrices and MDP convolutional codes
Superregular matrices are a type of lower triangular Toeplitz matrix that arises in the context of constructing convolutional codes having a maximum distance profile. These matrices are characterized by the property that the only submatrices having a zero determinant are those whose determinants are trivially zero due to the lower triangular structure. In this paper, we discuss how superregular...
متن کاملMDP Periodically Time-Varying Convolutional Codes
In this paper we use some classical ideas from linear systems theory to analyse convolutional codes. In particular, we exploit input-state-output representations of periodic linear systems to study periodically time-varying convolutional codes. In this preliminary work we focus on the column distance of these codes and derive explicit necessary and sufficient conditions for an (n, 2, 1) periodi...
متن کاملA new class of superregular matrices and MDP convolutional codes
This paper deals with the problem of constructing superregular matrices that lead to MDP convolutional codes. These matrices are a type of lower block triangular Toeplitz matrices with the property that all the square submatrices that can possibly be nonsingular due to the lower block triangular structure are nonsingular. We present a new class of matrices that are superregular over a sufficien...
متن کاملAutomated Explanations for MDP Policies
Explaining policies of Markov Decision Processes (MDPs) is complicated due to their probabilistic and sequential nature. We present a technique to explain policies for factored MDP by populating a set of domain-independent templates. We also present a mechanism to determine a minimal set of templates that, viewed together, completely justify the policy. We demonstrate our technique using the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2019
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-019-00661-6